New Online Algorithms for Story Scheduling in Web Advertising
نویسندگان
چکیده
منابع مشابه
Online story scheduling in web advertising
We study an online job scheduling problem motivated by storyboarding in web advertising, where an advertiser derives value from having uninterrupted sequential access to a user surfing the web. The user ceases to browse with probability 1− β at each step, independently. Stories (jobs) arrive online; job s has a length `s and a per-unit value vs. We get a value vs for every unit of the job that ...
متن کاملOnline Non-Preemptive Story Scheduling in Web Advertising
This paper is concerned with online story scheduling, motivated by storyboarding in online advertising. In storyboarding, triggered by the browsing history of a user, advertisers arrive online and wish to present a sequence of ads (stories) on the website. The user ceases to browse with probability 1− β at each time step. Once the user finishes watching an ad, the advertiser derives a reward. T...
متن کاملDynamic Online-Advertising Auctions as Stochastic Scheduling
We study dynamic models of online-advertising auctions in the Internet: advertisers compete for space on a web page over multiple time periods, and the web page displays ads in differentiated slots based on their bids and other considerations. The complex interactions between the advertisers and the website (which owns the web page) is modeled as a dynamic game. Our goal is to derive ad-slot pl...
متن کاملModels and Algorithms for Stochastic Online Scheduling
We consider a model for scheduling under uncertainty. In this model, we combine the main characteristics of online and stochastic scheduling in a simple and natural way. Job processing times are assumed to be stochastic, but in contrast to traditional stochastic scheduling models, we assume that jobs arrive online, and there is no knowledge about the jobs that will arrive in the future. The mod...
متن کاملCompetitive algorithms for multistage online scheduling
We study an online flow shop scheduling problem where each job consists of several tasks that have to be completed in t different stages and the goal is to maximize the total weight of accepted jobs. The set of tasks of a job contains one task for each stage and each stage has a dedicated set of identical parallel machines corresponding to it that can only process tasks of this stage. In order ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2018
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-018-0428-3